ABE: Providing a Low-Delay Service within best-effort

We propose Alternative Best-E ort (ABE), a novel service for IP networks, which relies on the idea of providing low-delay at the expense of maybe less throughput. The objective is to retain the simplicity of the original Internet single class, best e ort service, while providing low delay to interactive, adaptive applications. With ABE, every best e ort packet is marked as either green or blue. Green packets are guaranteed a low bounded delay in every router. In exchange, green packets are more likely to be dropped (or marked using congestion noti cation) during periods of congestion than blue packets. For every packet, the choice of one or other colour is made by the application, based on the nature of its traÆc and on global traÆc conditions. Typically, an interactive application with real-time deadlines, such as audio, will mark most of its packets as green, as long as the network conditions o er a large enough throughput. In contrast, an application that transfers binary data such as bulk data transfer, will seek to minimise overall transfer time and send blue traÆc. We propose router requirements that aim at enforcing bene t for all types of traÆc, namely, that green traÆc achieves a low delay and blue traÆc receives at least as much throughput as it would in a at (legacy) best-e ort network. ABE is di erent from di erentiated or integrated services in that neither packet colour can be said to receive better treatment, thus at rate pricing may be maintained, and there is no need for reservations or pro les. In this paper, we de ne the ABE service, its requirements, properties and usage. We discuss the implications of replacing the existing IP best e ort service by the ABE service. We propose and analyse an implementation based on a new scheduling method called Duplicate Scheduling with Deadlines (DSD). It supports any mixture of TCP, TCP Friendly and non TCP Friendly traÆc.